1342 - 2812 One - Way Functions and the Isomorphism Conjecture
نویسنده
چکیده
We study the Isomorphism Conjecture proposed by Berman and Hartmanis. It states that all sets complete for NP under polynomial-time many-one reductions are P-isomorphic to each other. From previous research it has been widely believed that all NP-complete sets are reducible each other by one-to-one and length-increasing polynomial-time reductions, but we may not hope for the full p-isomorphism due to the existence of one-way functions. Here we showed two results on the relation between one-way functions and the Isomorphism Conjecture. Firstly, we imporve the result of Agrawal [Agrawal, CCC’02] to show that if regular oneway functions exist, then all NP-complete sets are indeed reducible each other by one-toone, length-increasing and P/poly-reductions. A consequence of this result is the complete description of the structure of many-one complete sets of NP relative to a random oracle: all NP-complete sets are reducible each other by one-one and length-increasing polynomialtime reductions but (as already shown by [Kurtz etal, JACM 95]) they are not P-isomorphic. Neverthless, we also conjecture that (different from the random oracle world) all one-way functions should have some dense easy parts, which we call P/poly-easy cylinders, where they are P/poly-invertible. Then as our second result we show that if regular one-way functions exist and furthermore all one-one, length-increasing and P/poly-computable functions have P/poly-easy cylinders, then all many-one complete sets for NP are P/poly-isomorphic.
منابع مشابه
The Isomorphism Conjecture Holds andOne - way Functions
In this paper we demonstrate an oracle relative to which there are one-way functions but every paddable 1-li-degree collapses to an isomorphism type, thus yielding a relativized failure of the Joseph-Young Conjecture (JYC) JY85]. We then use this result to construct an oracle relative to which the Isomorphism Conjecture (IC) is true but one-way functions exist, which answers an open question of...
متن کاملOn the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملSome difference results on Hayman conjecture and uniqueness
In this paper, we show that for any finite order entire function $f(z)$, the function of the form $f(z)^{n}[f(z+c)-f(z)]^{s}$ has no nonzero finite Picard exceptional value for all nonnegative integers $n, s$ satisfying $ngeq 3$, which can be viewed as a different result on Hayman conjecture. We also obtain some uniqueness theorems for difference polynomials of entire functions sharing one comm...
متن کاملNew characterization of some linear groups
There are a few finite groups that are determined up to isomorphism solely by their order, such as $mathbb{Z}_{2}$ or $mathbb{Z}_{15}$. Still other finite groups are determined by their order together with other data, such as the number of elements of each order, the structure of the prime graph, the number of order components, the number of Sylow $p$-subgroups for each prime $p$, etc. In this...
متن کامل